A spectral bound for vertex-transitive graphs and their spanning subgraphs

For any finite, undirected, non-bipartite, vertex-transitive graph, we establish an explicit lower bound for the smallest eigenvalue of its normalised adjacency operator, which depends on graph only through degree and vertex-Cheeger constant. We also prove analogous result a large class irregular graphs, obtained as spanning subgraphs graphs. Using Babai, obtain operator in terms diameter degree.